Dispatcher I-queue Optimization in Join Idle Queue Algorithm for Improved Load Balancing in Cloud Computing

نویسندگان

چکیده

Objectives: Modern data centers serving web and mobile applications employ distributed load balancers. The Join Idle Queue (JIQ) algorithm is ideally suited for balancing in a setup. It attains fast response time by directing service requests to idle servers which can immediately process them. However, JIQ not optimal tracking leaving room improvement.
 Methods: We observed that assigns non-uniformly balancers some with no access servers. propose variant of the algorithm, Dispatcher I-queue Optimization (JIQ-DIO), increases probability having without additional communication overhead leading improved time.
 Findings: simulated JIQ-DIO on CloudSim Plus 3.0 compared it standard its different variants. was found increase incoming being directed lead more than two-fold improvement across broad range parameters.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Review on Sla Aware Load Balancing Algorithm Using Join-idle Queue in Cloud Computing

The emerging technology in the area of Information technology is Cloud Computing. Cloud Computing is the term associated with the virtualization, networking, software and services offered by web. The elements involved in cloud computing are clients, datacenter and distributed server. One of the main problems in cloud computing is load balancing. Balancing the load means to distribute the worklo...

متن کامل

Join-Idle-Queue: A novel load balancing algorithm for dynamically scalable web services

The prevalence of dynamic-content web services, exemplified by search and online social networking, has motivated an increasingly wide web-facing front end. Horizontal scaling in the Cloud is favored for its elasticity, and distributed design of load balancers is highly desirable. Existing algorithms with a centralized design, such as Join-the-Shortest-Queue (JSQ), incur high communication over...

متن کامل

Distributed Join-the-Idle-Queue for Low Latency Cloud Services

Low latency is highly desirable for cloud services. To achieve low response time, stringent timing requirements are needed for task scheduling in a large-scale server farm spanning thousands of servers. In this paper, we conduct an in-depth analysis for distributed Join-the-Idle-Queue (JIQ), a promising new approximation of an idealized task-scheduling algorithm. In particular, we derive semi-c...

متن کامل

Improved Ant Colony Load Balancing Algorithm in Cloud Computing

Cloud computing mainly deals with networking, software, data access and storage services that may not require end-user knowledge of the physical location and configuration of the system that is delivering the services. In the cloud storage, load balancing is a key issue. Load balancing is one of the main challenge in cloud computing which is required to distribute the dynamic workload across mu...

متن کامل

Optimization Task Scheduling Algorithm in Cloud Computing

Since software systems play an important role in applications more than ever, the security has become one of the most important indicators of softwares.Cloud computing refers to services that run in a distributed network and are accessible through common internet protocols. Presenting a proper scheduling method can lead to efficiency of resources by decreasing response time and costs. This rese...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of applied research and technology

سال: 2023

ISSN: ['2448-6736']

DOI: https://doi.org/10.22201/icat.24486736e.2023.21.2.1621